An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
نویسندگان
چکیده
In the bin covering problem there is a group L=(a1; : : : ; an) of items with sizes s̃(ai)∈ (0; 1), and the goal is to 6nd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In this paper we present the 6rst asymptotic fully polynomial-time approximation scheme for the problem. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems
Recently Bansal and Sviridenko [4] proved that for 2-dimensional Orthogonal Rectangle Bin Packing without rotations allowed there is no asymptotic PTAS, unless P = NP. We show that similar approximation hardness results hold for several rectangle packing and covering problems even if rotations by ninety degrees around the axes are allowed. Moreover, for some of these problems we provide explici...
متن کاملHardness of approximation for orthogonal rectangle packing and covering problems
Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Bin Packing (without rotations), unless P = NP. We show that similar approximation hardness results hold for several 2and 3-dimensional rectangle packing and covering problems even if rotations by ninety degrees are allowed. Moreover, for some of these problems we provide explicit lower bounds on asym...
متن کاملA New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
In this paper we introduce a new general approximation method for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programming (LP) relaxation, leading to a partial integer solution, and the application of a wellbehaved approximation algorithm to complete this solution. If the value of the solution returned by the latter can be ...
متن کاملA Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
We present a new lemma stating that, given an arbitrary packing of a set of rectangles into a larger rectangle, a “structured” packing of nearly the same set of rectangles exists. This lemma has several implications on the approximability of 2-dimensional packing problems. In this paper, we use it to show the existence of a polynomial-time approximation scheme for 2-dimensional geometric knapsa...
متن کاملBin packing with general cost structures
Following the work of Anily et al., we consider a variant of bin packing, called BIN PACKING WITH GENERAL COST STRUCTURES (GCBP) and design an asymptotic fully polynomial time approximation scheme (AFPTAS) for this problem. In the classic bin packing problem, a set of one-dimensional items is to be assigned to subsets of total size at most 1, that is, to be packed into unit sized bins. However,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 306 شماره
صفحات -
تاریخ انتشار 2002